Improving the Time Efficiency of ILP-based Multi-Relational Concept Discovery with Dynamic Programming Approach
نویسندگان
چکیده
8:30-9:30 Registration/Coffee 9:30 Welcome 9:45-10:35 Keynote 1 Prof Sir Tony Hoare FRS (Chair: Erol Gelenbe, Room: WLTH) 10:40-11:40 SESSION 1.1: Optimisation (Chair: Javier Barria, Room: WLTH) Network flow approaches for an asset-task assignment problem with execution uncertainty Stelios Timotheou (Imperial College London, UK) Improving the Time Efficiency of ILP-based Multi-Relational Concept Discovery with Dynamic Programming Approach Alev Mutlu (Middle East Technical University, Turkey), Mehmet Ali Berk (Aselsan Inc, Turkey), Pinar Senkul (Middle East Technical University, Turkey) A Genetic Algorithm Approach to the Artillery Target Assignment Problem Burcin Sapaz, Ismail Toroslu, Gokturk Ucoluk (METU, Turkey) SESSION 1.2: Statistical Analysis (Chair: Ethem Alpaydin, Room: City of London 3) Density Sensitive Based Spectral Clustering Qingsheng Zhu, Peng Yang (Chongqing University, China) Dependence Analysis for Regression Test Suite Selection and Augmentation Hasan Ural (University of Ottawa, Canada), Husnu Yenigun (Sabanci University, Turkey) FLIP-ECOC: A Greedy Optimization of the ECOC Matrix Cemre Zor, Berrin Yanikoglu (Sabanci University, Turkey), Terry Windeatt (University of Surrey, UK), Ethem Alpaydin (Bogazici University, Turkey SESSION 1.3: Hardware (Chair: Ricardo Lent, Room: Conference Room) Defect-Tolerant Logic Mapping for Nanocrossbars based on Two-Dimensional Sort Sezer Goren, H. Fatih Ugurdag, Okan Palaz (Bahcesehir University, Turkey) Hybrid Heuristics for Optimizing Energy Consumption in Embedded Systems Maha Idrissi Aouad (INRIA Nancy Grand Est, France), René Schott (IECN – LORIA, France), Olivier Zendra (INRIA Nancy Grand Est, France) A Truly Random Number Generator Based on a Pulse Excited Cross Coupled Chaotic Oscillator Salih Ergun (TUBITAK, Turkey)
منابع مشابه
An Ilp - Based Concept Discovery System for Multi - Relational Data Mining
AN ILP-BASED CONCEPT DISCOVERY SYSTEM FOR MULTI-RELATIONAL DATA MINING Kavurucu, Yusuf Ph.D., Department of Computer Engineering Supervisor : Asst. Prof. Dr. Pınar Şenkul July 2009, 118 pages Multi Relational Data Mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. However, as patter...
متن کاملMeasuring a Dynamic Efficiency Based on MONLP Model under DEA Control
Data envelopment analysis (DEA) is a common technique in measuring the relative efficiency of a set of decision making units (DMUs) with multiple inputs and multiple outputs. Standard DEA models are quite limited models, in the sense that they do not consider a DMU at different times. To resolve this problem, DEA models with dynamic structures have been proposed.In a recent pape...
متن کاملFOIL-D: Efficiently Scaling FOIL for Multi-relational Data Mining of Large Datasets
Multi-relational rule mining is important for knowledge discovery in relational databases as it allows for discovery of patterns involving multiple relational tables. Inductive logic programming (ILP) techniques have had considerable success on a variety of multi-relational rule mining tasks, however, most ILP systems do not scale to very large datasets. In this paper we present two extensions ...
متن کاملAggregation in Confidence-Based Concept Discovery for Multi-Relational Data Mining
Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. Several relational knowledge discovery systems have been developed employing various search strategies, heuristics, language pattern limitations and hypothesis evaluation criteria, in order to cope with intract...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کامل